Papers with ODQA datasets

10 papers
Self-Prompting Large Language Models for Zero-Shot Open-Domain QA (2024.naacl-long)

Copied to clipboard

Challenge: Open-Domain Question Answering (ODQA) aims to answer questions without explicitly providing specific background documents.
Approach: They propose a framework to explicitly utilize the massive knowledge encoded in LLM parameters and their strong instruction understanding abilities.
Outcome: The proposed framework surpasses state-of-the-art methods on three widely-used ODQA datasets and achieves comparable performance with customized fine-tuned models on full training data.
Aligning Retrieval with Reader Needs: Reader-Centered Passage Selection for Open-Domain Question Answering (2025.coling-main)

Copied to clipboard

Challenge: Existing retrieval methods aim to gather relevant passages but fail to prioritize consistent and useful information for the reader.
Approach: They propose a novel method which re-ranks passages based on the reader's prediction probability distribution and clusters passage according to the predicted answers.
Outcome: The proposed method improves the quality of evidence passages under zero-shot scenarios.
Chain-of-Skills: A Configurable Model for Open-Domain Question Answering (2023.acl-long)

Copied to clipboard

Challenge: Using customized retrieval models, model transferability and scalability are limited.
Approach: They propose a modular retrieval model where individual modules correspond to key skills that can be reused across datasets.
Outcome: The proposed model outperforms self-supervised retrievers in zero-shot evaluations and achieves state-of-the-art fine-tuned retrieval performance on NQ, HotpotQA and OTT-QA.
REANO: Optimising Retrieval-Augmented Reader Models through Knowledge Graph Generation (2024.acl-long)

Copied to clipboard

Challenge: Existing knowledge graphs suffer from incompleteness and lack information critical for answering given questions.
Approach: They propose to enhance the open domain question answering model with a knowledge graph generation module that generates KGs from the passages and an answer predictor.
Outcome: The proposed model improves the exact match score by 2.7% on the EntityQuestion dataset, with an average improvement of 1.8% across all the datasets.
RFiD: Towards Rational Fusion-in-Decoder for Open-Domain Question Answering (2023.findings-acl)

Copied to clipboard

Challenge: Open-domain Question Answering (ODQA) systems rely on spurious features instead of genuine causal relationships to generate answers.
Approach: They propose a model that leverages the encoders of FiD to distinguish between causal relationships and spurious features and guides the decoder to generate answers informed by this discernment.
Outcome: The proposed model improves on two ODQA datasets and shows that it can identify causal relationships and identify spurious features.
Learning to Retrieve Passages without Supervision (2022.naacl-main)

Copied to clipboard

Challenge: Dense retrievers for open domain question answering have been shown to achieve impressive performance by training on large datasets of question-passage pairs.
Approach: They propose to use recurring spans to create pseudo examples for contrastive learning.
Outcome: The proposed model outperforms all pretrained baselines on a wide range of ODQA datasets and is competitive with BM25, a strong sparse baseline.
RobustQA: Benchmarking the Robustness of Domain Adaptation for Open-Domain Question Answering (2023.findings-acl)

Copied to clipboard

Challenge: Existing ODQA datasets consist mainly of Wikipedia corpus, and are insufficient to study models’ generalizability across diverse domains.
Approach: They propose a benchmark to evaluate ODQA's domain robustness using Wikipedia corpus . they annotate QA pairs in retrieval datasets with rigorous quality control .
Outcome: The proposed benchmark improves model performance on annotated QA pairs in retrieval datasets with rigorous quality control.
Dual Reader-Parser on Hybrid Textual and Tabular Evidence for Open Domain Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Existing generative models for open-domain question answering focus on generating direct answers from unstructured textual information, but a large amount of knowledge is stored in structured databases, and need to be accessed using query languages such as SQL.
Approach: They propose a hybrid framework that takes both textual and tabular evidences as input and generates either direct answers or SQL queries depending on which form could better answer the question.
Outcome: The proposed framework outperforms baseline models on OpenSQuAD datasets and can generate SQL queries on the associated databases to obtain the final answers.
Open-domain Question Answering via Chain of Reasoning over Heterogeneous Knowledge (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing open-domain question answering methods rely on the retriever to gather all evidence in isolation, but our approach uses an intermediary module to perform a chain of reasoning over the retrieved set.
Approach: They propose a new open-domain question answering framework that integrates an intermediary module into the current retriever-reader pipeline and integrates it into the model.
Outcome: The proposed framework outperforms the state-of-the-art on two OTT-QA datasets with an exact match score of 47.3 (45% relative gain).
Not All Terms Matter: Recall-Oriented Adaptive Learning for PLM-aided Query Expansion in Open-Domain Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Open-domain question answering (ODQA) systems typically adopt a retriever-reader architecture, where the retriever finds relevant documents, and the reader extracts or synthesizes answers.
Approach: They propose a method that iteratively adjusts the importance weights of QE terms based on their relevance, refining term distinction and enhancing the separation of relevant terms.
Outcome: The proposed method improves retrieval accuracy and overall performance on four ODQA datasets and five QE methods.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations